Inducing Polygons of Line Arrangements
نویسندگان
چکیده
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for A in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound. Eligible for best student paper
منابع مشابه
ACS Algorithms for Complex Shapes with Certified Numerics and Topology Exact and Efficient Construction of Planar Arrangements of Circular Arcs and Line Segments with Applications
We describe a simple yet powerful approach for computing planar arrangements of circular arcs and line segments in a robust and exact manner. Constructing arrangements using this approach is about one order of magnitude faster compared to other techniques that employ the exact computation paradigm. We have successfully applied our technique for computing offsets of planar polygons and for perfo...
متن کاملOn The Watchman Route Problem and Its Related Problems
We propose to study the watchman route problem and its related problems. The watchman route problem asks a shortest closed path within a given polygon so that every point in the polygon is visible from at least one point on the path. We first discuss the watchman route problem for simple polygons, for polygonal domains, and for arrangements of lines and line segments. We then focus on a problem...
متن کاملRobust Point Location in Approximate Polygons (extended Abstract)
Introduction Most geometric algorithms assume that perfect \real" arithmetic is available. When these algorithms are implemented they often fail because this assumption is not borne out; that is, these algorithms are not robust. This failure occurs because either the input or the intermediate calculations are imprecise, leading to inconsistent decisions by the algorithm. This paper presents a f...
متن کاملConvex-Arc Drawings of Pseudolines
Introduction. A pseudoline is formed from a line by stretching the plane without tearing: it is the image of a line under a homeomorphism of the plane [13]. In arrangements of pseudolines, pairs of pseudolines intersect at most once and cross at their intersections. Pseudoline arrangements can be used to model sorting networks [1], tilings of convex polygons by rhombi [4], and graphs that have ...
متن کاملRobust Point Location in Approximate Polygons
This paper presents a framework for reasoning about robust geoemtric algorithms. Robustness is formally deened and a data structure called an approximate polygon is introduced and used to reason about polygons constructed of edges whose positions are uncertain. A robust algorithm for point location in an approximate polygon is presented. The algorithm uses only the signature of the point (not i...
متن کامل